package com.neutech.day04.demo.Demo;

import java.util.Arrays;

/**
 *冒泡排序算法
 */
public class Demo02 {
    public static void main(String[] args) {
        int[] arr = {15,55,4,23,16,1,98,33};
        arr = bubbleSort(arr);
        System.out.println(Arrays.toString(arr));
    }
    public static int[] bubbleSort(int[] arr) {
        for (int i = 0; i < arr.length - 1; i++) {
            for (int j = 0; j < arr.length - i - 1; j++) {
                if (arr[j] > arr[j+1]) {
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
        }
        return arr;
    }
}

